Computer and Modernization ›› 2012, Vol. 203 ›› Issue (7): 41-43.doi: 10.3969/j.issn.1006-2475.2012.07.011

• 算法设计与分析 • Previous Articles     Next Articles

Iterative Elimination Algorithm on Z(pk) for Computing Inverse Elements

LIU Ping   

  1. Gansu Normal University for Nationalities, Hezuo 747000, China
  • Received:2012-03-08 Revised:1900-01-01 Online:2012-08-10 Published:2012-08-10

Abstract: This paper discusses the algorithm on Z(pk) for computing inverse elements, while p is a prime. The paper introduces the concept of order of reversible element and the algorithm called the iterative elimination by bit. The complexity of this algorithm is O((logpn)2).

Key words: remaider class ring, inverse element, iterative elimination by bit

CLC Number: